
You are where you tweet a content%2Dbased approach to geo%2Dlocating twitter users.

A Summary of Granular Computing System Vulnerabilities Exploring the Dark Side of Social Networking Communities.

Community%2Dbased ranking of the social web.

Devils%2C Angels%2C and Robots Tempting Destructive Users in Social Media.
Social media sites derive their value by providing a popular and dependable community for participants to engage, share, and interact. This community value and related services like search and advertising are threatened by spammers, content polluters, and malware disseminators. In an effort to preserve community value and ensure long-term success, we present a prototype system for automatically detecting and profiling destructive users in social media. We described the architecture of the system – inspired by the “broken windows ” theory embraced by law enforcement – the results and insights gained from a preliminary study conducted to determine the efficacy of our approach, and a discussion of our ongoing research.
Uncovering social spammers social honeypots   machine learning.



PageRank for ranking authors in co%2Dcitation networks

The SocialTrust framework for trusted social information management Architecture and algorithms.

Probabilistic Generative Models of the Social Annotation Process.

Ranking Comments on the Social Web.

A Categorical Model for Discovering Latent Structure in Social Annotations.

Analyzing and Predicting Community Preference of Socially Generated Metadata A Case Study on Comments in the Digg Community.

Granular Computing System Vulnerabilities Exploring the Dark Side of Social Networking Communities.

Data Dictionary.

Topic Maps.
To address the critical issues of findability, shareability and reusability of learning resources, we propose an authoring environment for building, maintaining, and using standardsbased, ontology-aware e-learning repositories. The proposed environment, TM4L (Topic Maps for Learning), is based on the new ISO standard XML Topic Maps (XTM). 1
Data Dictionary.

Dublin Core.

Dublin Core.

A Parameterized Approach to Spam%2DResilient Link Analysis of the Web.

A Parameterized Approach to Spam%2DResilient Link Analysis of the Web.

PageRank for ranking authors in co%2Dcitation networks.

Social Honeypots Making Friends With A Spammer Near You.
Social networking communities have become an important communications platform, but the popularity of these communities has also made them targets for a new breed of social spammers. Unfortunately, little is known about these social spammers, their level of sophistication, or their strategies and tactics. Thus, in this paper, we provide the first characterization of social spammers and their behaviors. Concretely, we make two contributions: (1) we introduce social honeypots for tracking and monitoring social spam, and (2) we report the results of an analysis performed on spam data that was harvested by our social honeypots. Based on our analysis, we find that the behaviors of social spammers exhibit recognizable temporal and geographic patterns and that social spam content contains various distinguishing characteristics. These results are quite promising and suggest that our analysis techniques may be used to automatically identify social spam. 1
Predicting web spam with HTTP session information.
Web spam is a widely-recognized threat to the quality and security of the Web. Web spam pages pollute search engine indexes, burden Web crawlers and Web mining services, and expose users to dangerous Web-borne malware. To defend against Web spam, most previous research analyzes the contents of Web pages and the link structure of the Web graph. Unfortunately, these heavyweight approaches require full downloads of both legitimate and spam pages to be effective, making real-time deployment of these techniques infeasible for Web browsers, high-performance Web crawlers, and real-time Web applications. In this paper, we present a lightweight, predictive approach to Web spam classification that relies exclusively on HTTP session information (i.e., hosting IP addresses and HTTP session headers).
A Large%2DScale Study of MySpace Observations and Implications for Online Social Networks.
We study the characteristics of large online social networks through an extensive analysis of over 1.9 million MySpace profiles in an effort to understand who is using these networks and how they are being used. We study MySpace through a comparative study over three different, but related, facets: (i) the sociability of users in MySpace based on relationship, messaging, and group participation; (ii) the demographic characteristics of MySpace users in terms of age, gender, and location, and a study of how these factors correlate with their privacy preferences; and (iii) the text artifacts of MySpace users, which can be used to construct language models that distinguish MySpace users not just by who they say they are but also by the language model they employ. We find a number of surprising results and conjecture several potential research directions based on our observations.
Socialtrust tamper%2Dresilient trust establishment in online communities.
Web 2.0 promises rich opportunities for information sharing, electronic commerce, and new modes of social interaction, all centered around the“social Web”of user-contributed content, social annotations, and person-to-person social connections. But the increasing reliance on this “social Web ” also places individuals and their computer systems at risk, creating opportunities for malicious participants to exploit the tight social fabric of these networks. With these problems in mind, we propose the SocialTrust framework for tamperresilient trust establishment in online communities. Social-Trust provides community users with dynamic trust values by (i) distinguishing relationship quality from trust; (ii) incorporating a personalized feedback mechanism for adapting as the community evolves; and (iii) tracking user behavior. We experimentally evaluate the SocialTrust framework using real online social networking data consisting of millions of MySpace profiles and relationships. We find that SocialTrust supports robust trust establishment even in the presence of large-scale collusion by malicious participants.
Towards robust trust establishment in web%2Dbased social networks with socialtrust.

Plurality a context%2Daware personalized tagging system.

Exploring Feedback Models in Interactive Tagging.

Characterizing Web Spam Using Content and HTTP Session Analysis.
Web spam research has been hampered by a lack of statistically significant collections. In this paper, we perform the first large-scale characterization of web spam using content and HTTP session analysis techniques on the Webb Spam Corpus – a collection of about 350,000 web spam pages. Our content analysis results are consistent with the hypothesis that web spam pages are different from normal web pages, showing far more duplication of physical content and URL redirections. An analysis of session information collected during the crawling of the Webb Spam Corpus shows significant concentration of hosting IP addresses in two narrow ranges as well as significant overlaps among session header values. These findings suggest that content and HTTP session analysis may contribute a great deal towards future efforts to automatically distinguish web spam pages from normal web pages. 1.
DSphere A Source%2DCentric Approach to Crawling

Spam%2DResilient Web Rankings via Influence Throttling.
Web search is one of the most critical applications for managing the massive amount of distributed Web content. Due to the overwhelming reliance on Web search, there is a rise in efforts to manipulate (or spam) Web search engines. In this paper, we develop a spam-resilient ranking model that promotes a source-based view of the Web. One of the most salient features of our spam-resilient ranking algorithm is the concept of influence throttling. We show how to utilize influence throttling to counter Web spam that aims at manipulating link-based ranking systems, especially PageRank-like systems. Through formal analysis and experimental evaluation, we show the effectiveness and robustness of our spam-resilient ranking model in comparison with existing Web algorithms such as PageRank. 1.
Countering web spam with credibility%2Dbased link analysis.

Service Class Driven Dynamic Data Source Discovery with DynaBot.

Development of Distance Measures for Process Mining%2C Discovery and Integration.

Process Mining by Measuring Process Block Similarity.

Introducing the Webb Spam Corpus Using Email Spam to Identify Web Spam Automatically.
Just as email spam has negatively impacted the user messaging experience, the rise of Web spam is threatening to severely degrade the quality of information on the World Wide Web. Fundamentally, Web spam is designed to pollute search engines and corrupt the user experience by driving traffic to particular spammed Web pages, regardless of the merits of those pages. In this paper, we identify an interesting link between email spam and Web spam, and we use this link to propose a novel technique for extracting large Web spam samples from the Web. Then, we present the Webb Spam Corpus – a first-of-its-kind, large-scale, and publicly available Web spam data set that was created using our automated Web spam collection method. The corpus consists of nearly 350,000 Web spam pages, making it more than two orders of magnitude larger than any other previously cited Web spam data set. Finally, we identify several application areas where the Webb Spam Corpus may be especially helpful. Interestingly, since the Webb Spam Corpus bridges the worlds of email spam and Web spam, we note that it can be used to aid traditional email spam classification algorithms through an analysis of the characteristics of the Web pages referenced by email messages. 1.
Distributed query sampling a quality%2Dconscious approach.

Process Mining%2C Discovery%2C and Integration using Distance Measures.
Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating processoriented services has attracted growing attention in the recent year. In this paper we present a quantitative approach to modeling and capturing the similarity and dissimilarity between different process designs. We derive the similarity measures by analyzing the process dependency graphs of the participating workflow processes. We first convert each process dependency graph into a normalized process matrix. Then we calculate the metric space distance between the normalized matrices. This distance measure can be used as a quantitative and qualitative tool in process mining, process merging, and process clustering, and ultimately it can reduce or minimize the costs involved in design, analysis, and evolution of workflow systems. 1.
Distributed query sampling a quality%2Dconscious approach.

XWRAPComposer A Multi%2DPage Data Extraction Service.

Discovering Interesting Relationships among Deep Web Databases A Source%2DBiased Approach.

Domain%2DSpecific Web Service Discovery with Service Class Descriptions.
This paper presents DynaBot, a domain-specific web service discovery system. The core idea of the DynaBot service discovery system is to use domain-specific service class descriptions powered by an intelligent Deep Web crawler. In contrast to current registry-based service discovery systems – like the several available UDDI registries – DynaBot promotes focused crawling of the Deep Web of services and discovers candidate services that are relevant to the domain of interest. It uses intelligent filtering algorithms to match services found by focused crawling with the domain-specific service class descriptions. We demonstrate the capability of DynaBot through the BLAST scenario and describe our initial experience with DynaBot. 1

XWRAPComposer A Multi%2DPage Data Extraction Service for Bio%2DComputing Applications.


QA%2DPagelet Data Preparation Techniques for Large%2DScale Data Analysis of the Deep Web.
This paper presents the QA-Pagelet as a fundamental data preparation technique for large scale data analysis of the Deep Web. To support QA-Pagelet extraction, we present the Thor framework for sampling, locating, and partioning the QA-Pagelets from the Deep Web. Two unique features of the Thor framework are (1) the novel page clustering for grouping pages from a Deep Web source into distinct clusters of control-flow dependent pages; and (2) the novel subtree filtering algorithm that exploits the structural and content similarity at subtree level to identify the QA-Pagelets within highly ranked page clusters. We evaluate the effectiveness of the Thor framework through experiments using both simulation and real datasets. We show that Thor performs well over millions of Deep Web pages and over a wide range of sources, including eCommerce sites, general and specialized search engines, corporate websites, medical and legal resources, and several others. Our experiments also show that the proposed page clustering algorithm achieves low-entropy clusters, and the subtree filtering algorithm identifies QA-Pagelets with excellent precision and recall.
A methodical approach to extracting interesting objects from dynamic web pages.
Abstract: This paper presents a fully automated object extraction system for web documents. Our methodology consists of a layered framework and a suite of algorithms. A distinct feature of our approach is the full automation of both the extraction of data object regions from dynamic Web pages and the identification of correct object boundary separators. We implemented the methodology in the XWRAPElite object extraction system and evaluated the system using more than 3,200 pages over 75 diverse web sites. Our experiments show three important and interesting results: First, our algorithms for identifying the minimal object rich subtree achieves 96 % success rate over all web pages we have tested. Second, our algorithms for discovering and extracting object separator tags reach the success rate of 95%. Most significantly, the overall system achieves precision between 96 % and 100 % (returns only correct objects) and excellent recall (between 95 % and 96%, with very few significant objects left out). The minimal subtree extraction algorithms and the object boundary identification algorithms are fast, about 87 milliseconds per page with an average page size of 30KB.
Probe
nonlinear rheology with inertio-elastic oscillations
Discovering and ranking web services with BASIL a personalized approach with biased focus.

